Time Improving Policy of Text Clustering Algorithm by Reducing Computational Overheads
نویسندگان
چکیده
منابع مشابه
Reducing scheduling overheads in multi-processors real-time systems
In real-time systems, it is required to complete all work on a timely basis. There are mainly two types of real time systems: hard real-time systems (HRT) and soft-real time (SRT) systems. In hard real-time systems, a missed deadline is considered a system failure; in soft real-time systems some deadlines may be missed. The aim of real-time scheduling analysis is to ensure a sequence of jobs me...
متن کاملOPTIMIZATION OF FUZZY CLUSTERING CRITERIA BY A HYBRID PSO AND FUZZY C-MEANS CLUSTERING ALGORITHM
This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...
متن کاملImproving Runtime Overheads for detectEr
Runtime Verification (RV) [11] is a lightweight verification technique mitigating the scalability issues associated with exhaustive verification techniques such as model checking. Low overheads are an important requirement for the viability of any RV framework, where the additional computation introduced by the monitors should ideally be kept to a minimum. detectEr[3, 7] is an RV tool for analy...
متن کاملImproving Social Recommendations by applying a Personalized Item Clustering Policy
In online Recommender Systems, people tend to consume and rate items that are not necessarily similar to one another. This phenomenon is a direct consequence of the fact that human taste is influenced by many factors that cannot be captured by pure Content-based or Collaborative Filtering approaches. For this reason, a desirable property of Recommender Systems would be to identify correlations ...
متن کاملReducing Address Translation Overheads with Virtual Caching
This dissertation research addresses overheads in supporting virtual memory, especially virtual-to-physical address translation overheads (i.e., performance, power, and energy) via a Translation Lookaside Buffer (TLB). To overcome the overheads, we revisit virtually indexed, virtually tagged caches. In practice, they have not been common in commercial microarchitecture designs, and the crux of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/ijca2015905320